|
週次 |
日期 |
單元主題 |
|
Week 1 |
2016/09/13 |
Introduction
Asymptotic Notations
|
|
Week 2 |
2016/09/20 |
Asymptotic Notations (Cont'd)
Recurrence Relations |
|
Week 3 |
2016/09/27 |
No Class |
|
Week 4 |
2016/10/04 |
Recurrence Relations (Cont'd)
Divide & Conquer Algorithms
Comparison Sorting |
|
Week 5 |
2016/10/11 |
Comparison Sorting (Cont'd)
Order Statistics |
|
Week 6 |
2016/10/18 |
Greedy Algorithms
Dynamic Programming |
|
Week 7 |
2016/10/25 |
Non-Comparison Sorting
Heap Structure
Amortized Analysis |
|
Week 8 |
2016/11/01 |
Fibonacci Heap |
|
Week 9 |
2016/11/08 |
Midterm |
|
Week 10 |
2016/11/15 |
No class |
|
Week 11 |
2016/11/22 |
Disjoint Set
Definition of Graph |
|
Week 12 |
2016/11/29 |
Searching Algorithms
Topological Sort |
|
Week 13 |
2016/12/06 |
Shortest Path Problem & Algorithms |
|
Week 14 |
2016/12/17 |
Minimum Spanning Tree
Flow Network
Max Flow Problem |
|
Week 14 |
2016/12/13 |
No Class |
|
Week 15 |
2016/12/20 |
Edmonds-Karp Algorithm
Maximum Matching & Stable Matching
Gale-Shapley Proposing Algorithm
Decision Problem
P & NP
NP-completeness
|
|
Week 16 |
2016/12/27 |
NP-complete Reduction
Approximate Algorithms |
|
Week 17 |
2017/01/03 |
Approximation Algorithms (Cont'd)
|
|
Week 18 |
2016/01/10 |
Final |